An Abel-Tauber Theorem for Laplace Transforms

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Finite-Interval Uniqueness Theorem for Bilateral Laplace Transforms

Two or more bilateral Laplace transforms with a complex argument “s” may be equal in a finite vertical interval when, in fact, the transforms correspond to different functions. In this article, we prove that the existence of a bilateral Laplace transform in any finite horizontal interval uniquely determines the corresponding function. The result appears to be new as we could not find it in the ...

متن کامل

A Tauberian Theorem for Laplace Transforms with Pseudofunction Boundary Behavior

The prime number theorem provided the chief impulse for complex Tauberian theory, in which the boundary behavior of a transform in the complex plane plays a crucial role. We consider Laplace transforms of bounded functions. Our Tauberian theorem does not allow first-order poles on the imaginary axis, but any milder singularities, characterized by pseudofunction boundary behavior, are permissibl...

متن کامل

The h-Laplace and q-Laplace transforms

Article history: Received 12 May 2009 Available online 6 October 2009 Submitted by B.S. Thomson

متن کامل

Laplace Transforms for Numericalinversion via Continued

It is often possible to e ectively calculate cumulative distribution functions and other quantities of interest by numerically inverting Laplace transforms. However, to do so it is necessary to compute the Laplace transform values. Unfortunately, convenient explicit expressions for required transforms are often unavailable. In that event, we show that it is sometimes possible to nd continued-fr...

متن کامل

Algorithms for Unequally Spaced Fast Laplace Transforms

Vol. 1 (2013) pp. 37-46. ALGORITHMS FOR UNEQUALLY SPACED FAST LAPLACE TRANSFORMS FREDRIK ANDERSSON⇤ Abstract. We develop fast algorithms for unequally spaced discrete Laplace transforms with complex parameters, which are approximate up to prescribed choice of computational precision. The algorithms are based on modifications of algorithms for unequally spaced fast Fourier transforms using Gauss...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the London Mathematical Society

سال: 1976

ISSN: 0024-6107

DOI: 10.1112/jlms/s2-13.3.537